COMP 520 FallType checking (1) COMP 520 Fall 2007

Source URL: www.sable.mcgill.ca

• Type theory
• Symbol
• Type system
• Mathematical logic
• Logic in computer science
• Theoretical computer science
• Automated theorem proving
• Logic programming

Mostly-Automated Verification of Low-Level Programs in Computational Separation Logic Adam Chlipala Harvard University PLDI 2011

Source URL: adam.chlipala.net

• Theoretical computer science
• Logic in computer science
• Formal methods
• Constraint programming
• Electronic design automation
• Satisfiability modulo theories
• Separation logic
• Mathematical logic
• Logic programming
• Logic

Food Bytes: Intelligent Systems in the Food Industry David Corney1 Dept. Computer Science, University College London, Gower Street, London, WC1E 6BT

Source URL: www.dcorney.com

• Artificial intelligence
• Fuzzy logic
• Logic
• Applied mathematics
• Cognitive science
• Neuro-fuzzy
• Fuzzy control system
• Artificial neural network
• Machine learning
• Hybrid intelligent system
• Fuzzy set
• Evolving classification function

Forward and Backward Guarding in Early Output Logic Charlie Brej and Doug Edwards School of Computer Science, The University of Manchester,Oxford Road, Manchester, M13 9PL, UK Email: {cbrej,dedwards}@cs.man.ac.uk Abstrac

Source URL: apt.cs.manchester.ac.uk

The parallel implementation of the Astr´ ee static analyzer David Monniaux http://www.di.ens.fr Centre national de la recherche scientifique (CNRS)

Source URL: www-verimag.imag.fr

• Theoretical computer science
• Logic in computer science
• Software engineering
• Formal methods
• Models of computation
• Parallel computing
• Programming language semantics
• Denotational semantics
• Abstract interpretation
• Semantics
• Astre

First-order satisfiability in Gödel logics: an NP-complete fragment Matthias Baaza,1 , Agata Ciabattonia,2 , Norbert Preininga,b,3 a b

Source URL: www.preining.info

• Logic
• Mathematical logic
• Abstraction
• Model theory
• Non-classical logic
• Logic in computer science
• Predicate logic
• First-order logic
• Boolean satisfiability problem
• Gdel numbering
• Many-valued logic
• Kripke semantics

Anytime Inference in Probabilistic Logic Programs with TP -Compilation Jonas Vlasselaer, Guy Van den Broeck, Angelika Kimmig, Wannes Meert, Luc De Raedt Department of Computer Science KU Leuven, Belgium firstname.lastnam

Source URL: web.cs.ucla.edu

Backwards Abstract Interpretation of Probabilistic Programs David Monniaux http://www.di.ens.fr/~monniaux LIENS, 45 rue d’UlmParis cedex 5, France

Source URL: www-verimag.imag.fr

• Operator theory
• Theoretical computer science
• Measure theory
• Mathematics
• Analysis
• Denotational semantics
• Logic in computer science
• Hermitian adjoint
• Support
• Expected value
• Abstract interpretation
• Adjoint functors

Optimal Social Laws Thomas Ågotnes ∗ Michael Wooldridge

Source URL: www.aamas-conference.org

• Combinatory logic
• Lambda calculus
• Logic in computer science
• Symbol

Mind the Gap: Artifacts vs Insights in PL Theory Nada Amin∗ and Tiark Rompf ∗‡ ‡ ∗

Source URL: popl-obt-2014.cs.brown.edu

• Type theory
• Logic in computer science
• Calculus
• Twelf